discoveri applic workload network file trace understand applic access pattern situat gain insight applic data semant level help design effici storag system help creat benchmark mimic realist applic behavior close enabl autonom system inform obtain adapt system close loop case requir abil extract applic level semant oper method modifi applic code associ oper semant tag intrus network file system trace import sourc inform obtain intrus analyz robust formul handl uncertainti kernel matric studi problem uncertainti entri kernel matrix aris svm formul chanc constraint program larg deviat inequ deriv formul robust nois result formul appli nois gaussian finit support formul gener convex case interest reduc convex program problem uncertainti kernel matrix motiv real world problem classifi protein structur provid uncertainti formul deriv natur incorpor uncertainti principl manner lead signific improv state art discov busi process model unstructur activ log condit model dsmooth rank loss function learn rank import area interfac machin learn inform retriev web search central challeng optim measur rank loss object tend convex discontinu make function amen gradient base optim procedur design clever bound recent year boost neural network support vector machin techniqu appli work directli model condit probabl pr xq permut document rank xq repres featur vector respect queri major reason space huge document rank propos intuit appeal expect loss minim object give effici shortcut evalu huge space ys optim convex propos convex approxim give effici mont carlo sampl method comput object gradient approxim quasi newton optim lbfg extens experi wide letor dataset show larg rank accuraci improv recent competit algorithm discov rule disk event predict hard drive failur linear program approach estim structur spars linear genet network transcript profil data random algorithm larg scale svm random algorithm larg scale svm rapid resourc asian primari immunodefici diseas structur learn dsmooth rank loss learn rank relev judgment activ research area itemwis score regress pairwis prefer satisfact listwis structur learn major techniqu listwis structur learn appli recent optim import decompos rank criteria auc area roc curv map averag precis propos lineartim algorithm optim criteria wide evalu search system mrr reciproc rank ndcg normal discount cumul gain max margin structur learn framework demonstr rank criteria featur map search applic optim favor singl criterion cater varieti queri mrr navig queri ndcg inform queri kei contribut paper fold multipl rank loss function multi criteria max margin optim result singl robust rank model close accuraci learner train individu criteria fact experi popular letor trec data set show contrari convent wisdom test criterion serv train individu criterion cluster base genet algorithm larg margin approach writer independ onlin handwrit classif fr chet distanc base approach search onlin handwritten document focus crawl scalabl ordin regress solver paper propos scalabl cluster base ordin regress formul instanc order cone program socp order cone soc constraint main contribut paper fast algorithm cb solv propos formul effici gener purpos solver main contribut paper pose problem focus crawl larg scale ordin regress problem solv propos cb focus crawl effici mechan discov resourc interest web pose problem focus crawl ordin regress problem avoid neg class topic hierarchi main drawback exist focus crawl method experi larg synthet benchmark dataset show scalabl cb experi show propos focus crawler outperform state art structur align base kernel protein structur classif structur align wide tool compar protein low sequenc similar main contribut paper deriv kernel protein structur align sequenc inform central kernel align algorithm match substructur fix size spectral graph match techniqu deriv posit semi definit kernel captur notion similar substructur base sophist kernel protein structur propos empir evalu kernel sequenc redund structur scop superfamili kernel svm show competit perform ce state art structur comparison program random algorithm larg scale support vector learn propos random algorithm larg scale svm learn solv problem iter random subset data crucial algorithm scalabl size subset chosen context text classif show idea random project sampl size log obtain solut close optim high probabl experi synthet real life data set demonstr algorithm scale svm learner loss accuraci kernel attribut pointset applic maximum margin classifi fals posit fals neg error rate paper address problem maximum margin classif moment class condit densiti fals posit fals neg error rate chebyshev inequ problem pose order cone program problem dual formul lead geometr optim problem comput distanc ellipsoid solv iter algorithm formul extend linear classifi kernel method result classifi appli case classif unbalanc dataset asymmetr cost misclassif experiment result benchmark dataset show efficaci propos method comparison protein structur grow neighborhood align cluster base larg margin classif scalabl approach socp formul express sincer gratitud advis dr chiranjib bhat tacharyya interest thought idea inspir ideal friendli natur made fill enthusiasm interest research phd approach spent ampl time lab mem ber discuss busi schedul prof murti dr sami bengio googl lab usa prof aharon ben tal technion israel oper greatli debt parent wife famili member support encourag phd year lab member friend karthik raman sourangshu rashmin krishnan sivaramakrishnan discuss comment depart scienc technolog india support finan cialli phd work opportun peopl directli indirectli help finish thesi public base thesi project fast protein structur retriev order cone program approach handl miss uncertain data propos order cone program formul design robust classifi handl uncertainti observ similar formul deriv design regress function robust uncertainti regress set propos formul independ underli distribut requir exist order moment formul special case miss valu observ classif regress problem experi show propos formul outperform imput order cone program approach handl miss uncertain data propos order cone program formul design robust classifi handl uncertainti observ similar formul deriv design regress function robust uncertainti regress set propos formul independ underli distribut requir exist order moment formul special case miss valu observ classif regress problem experi show propos formul outperform imput ascent phase trajectori optim hyperson vehicl nonlinear program effici algorithm intrus detect abstract detect user root attack import intrus detect task paper mix spectrum kernel probabilist suffix tree solut detect intrus effici experiment result real world dataset show propos approach outperform state art fisher kernel base method term speed loss accuraci time seri classif onlin tamil handwritten charact recognit kernel base approach order cone program formul classifi miss data propos convex optim base strategi deal uncertainti observ classif problem assum sampl xi yi distribut xi yi deriv robust formul distribut normal distribut lead order cone program formul method appli problem miss data outperform direct imput robust spars hyperplan classifi applic uncertain molecular profil data kei word robust spars hyperplan order cone program linear program breast cancer molecular profil class high dimension data order cone program formul featur select paper address issu featur select linear classifi moment class condit densiti problem pose find minim set featur result classifi low misclassif error bound misclassif error involv covari class condit densiti minim norm approxim criterion featur select order program formul deriv handl error estim covari tractabl robust formul discuss slightli set fisher discrimin deriv featur select fisher discrimin discuss experiment result synthet data set real life microarrai data show propos formul competit state art linear program formul simultan classif relev featur identif high ddimension space applic molecular profil data simultan relev featur identif classif high ddimension space molecular profil technolog monitor thousand transcript protein metabolit speci concurr biolog sampl interest class high dimension profil data nomin liknon specif implement methodolog perform simultan relev featur identif classif exploit properti minimis norm linear program yield spars hyperplan work examin comput softwar practic issu requir realis nomin liknon ii summaris result applic real world data set iii outlin heurist solut problem pose domain expert interpret result iv defin futur direct research minimax probabl machin construct classi er probabl correct classi cation futur data point maxim current paper desideratum translat direct optim problem solv method convex optim show exploit mercer kernel set obtain nonlinear decis boundari worst case bound probabl misclassi cation futur data obtain explicitli field method special class belief network chief aim paper propos field approxim broad class belief network sigmoid noisi network special case approxim base power field theori suggest plefka show saul jaakkola jordan approach order approxim plefka approach variat deriv applic plefka theori belief network computation tractabl tackl problem propos approxim base taylor seri small scale experi show propos scheme attract improv platt smo algorithm svm classifi design paper point import sourc confus ineci platt sequenti minim optim smo algorithm caus singl threshold clue kkt condit dual problem threshold paramet emploi deriv modic smo modi algorithm perform signicantli faster origin smo benchmark dataset introduct past year lot excit interest support vector machin yield excel gener perform wide rang problem recent fast iter algorithm easi implement suggest platt sequenti minim algorithm smo import remark featur smo extrem easi implement compar test algorithm platt shown smo faster variat dfield theori sigmoid belief network 